Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3

Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3

Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven

In order to reduce the number of add-drop multiplexers (ADMs) in SONET/WDM networks using wavelength add-drop multiplexing, certain graph decompositions can be used to form a “grooming” that specifies the assignment of traffic to wavelengths. When traffic among nodes is all-to-all and uniform, the drop cost of such a decomposition is the sum, over all graphs in the decomposition, of the number ...

Wavelength Assignment in WDM Rings to Minimize SONET ADMs

We study wavelength assignment for lightpaths over WDM rings to minimize the SONET ADMs used. This problem has attracted much attention recently. However, its computation complexity remains unknown, and the only known heuristic [6] which does not allow the splitting of lightpaths is problematic in both the algorithm itself and its performance analysis. We first prove the NP-completeness of this...

Grooming of Arbitrary Traffic in SONET / WDM Rings

SONET add-drop multiplexers (ADMs) are the dominant cost in SONET/WDM rings. They can potentially be reduced by optical bypass via wavelength adddrop multiplexers (WADMs) and trafflc grooming. While many works have been done o n the grooming of all-to-all uniform trafflc and one-to-all trafflc, the grooming of arbitrary t r a c have not been studied yet. In this paper we first proves the NP-har...

Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs